The Inclusion-exclusion Principle without Distributivity
نویسندگان
چکیده
ABSTRACT. Inspired by the article of P. Grzegorzewski [The inclusion-exclusion principle for IF-events, Inform. Sci. 181 (2011), 536–546], who has worked two generalizations of the inclusion-exclusion principle for IF-events, a generalization of the inclusion-exclusion principle for mappings with values in semigroups is presented here. The main idea is in replacing the distributivity and idempotency laws, by one new axiom.
منابع مشابه
The Inclusion-Exclusion Principle for IF-States
Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events.In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski's inclusion-exclusion principle for probabilities on IF-events.Finally, we give some applications of this principle by...
متن کاملThe Inclusion-exclusion Principle for If-states
Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events. In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski’s inclusion-exclusion principle for probabilities on IF-events. Finally, we give some applications of this principle ...
متن کاملq-DEFORMED FERMION OSCILLATORS, ZERO-POINT ENERGY AND INCLUSION-EXCLUSION PRINCIPLE
The theory of Fermion oscillators has two essential ingredients: zero-point energy and Pauli exclusion principle. We devlop the theory of the statistical mechanics of generalized q-deformed Fermion oscillator algebra with inclusion principle (i.e., without the exclusion principle), which corresponds to ordinary fermions with Pauli exclusion principle in the classical limit q → 1. Some of the re...
متن کاملModel Counting Using the Inclusion-Exclusion Principle
The inclusion-exclusion principle is a well-known mathematical principle used to count the number of elements in the union of a collection of sets in terms of intersections of sub-collections. We present an algorithm for counting the number of solutions of a given k-SAT formula using the inclusion-exclusion principle. The key contribution of our work consists of a novel subsumption pruning tech...
متن کاملInvitation to Algorithmic Uses of Inclusion-Exclusion
I give an introduction to algorithmic uses of the principle of inclusion–exclusion. The presentation is intended to be be concrete and accessible, at the expense of generality and comprehensiveness. R T 1 The principle of inclusion–exclusion. There are as many odd-sized as even-sized subsets sandwiched between two different sets: For R ⊆ T ,
متن کامل